An Algorithm for Dualization in Products of Lattices
نویسنده
چکیده
Let L = L1 × · · · × Ln be the product of n lattices, each of which has a bounded width. Given a subset A ⊆ L, we show that the problem of extending a given partial list of maximal independent elements of A in L can be solved in quasi-polynomial time.
منابع مشابه
Dualization on Partially Ordered Sets: Preliminary Results
The dualization problem on arbitrary posets is a crucial step in many applications in logics, databases, artificial intelligence and pattern mining. The objective of this paper is to study reductions of the dualization problem on arbitrary posets to the dualization problem on boolean lattices, for which output quasi-polynomial time algorithms exist. We introduce convex embedding and poset refle...
متن کاملAn Algorithm for Dualization in Products of Lattices and Its Applications
Let L = L1 × · · · × Ln be the product of n lattices, each of which has a bounded width. Given a subset A ⊆ L, we show that the problem of extending a given partial list of maximal independent elements of A in L can be solved in quasi-polynomial time. This result implies, in particular, that the problem of generating all minimal infrequent elements for a database with semi-lattice attributes, a...
متن کاملAn Incremental RNC Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension∗
We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is NC-reducible to the computation of an arbitrary maximal independent set for an induced sub-hypergraph. The latter problem is known to be in RNC. In particular, our reduction yields an incremental RNC dualization algorithm for hypergraphs of bounded edge size, a problem previou...
متن کاملAn Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is NC-reducible to the computation of an arbitrary maximal independent set for an induced sub-hypergraph. The latter problem is known to be in RNC. In particular, our reduction yields an incremental RNC dualization algorithm for hypergraphs of bounded edge size, a problem previou...
متن کاملExtended dualization: Application to maximal pattern mining
The dualization in arbitrary posets is a well-studied problem in combinatorial enumeration and is a crucial step in many applications in logics, databases, artificial intelligence and pattern mining. The objective of this paper is to study reductions of the dualization problem on arbitrary posets to the dualization problem on boolean lattices, for which output quasi-polynomial time algorithms e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002